Clique cover problem - PDFSEARCH.IO - Document Search Engine

Clique cover problem
Results: 16

#	Item
11	A Continuous Characterization of Maximal Cliques in k-uniform Hypergraphs Samuel Rota Bul`o, and Marcello Pelillo Dipartimento di Informatica. Universit` a Ca’ Foscari di Venezia. Add to Reading List Source URL: www.dsi.unive.it Language: English - Date: 2010-08-27 12:03:59 Graph operations Clique problem Clique Extremal graph theory Hypergraph Vertex cover Line graph Clique-sum Graph theory Theoretical computer science NP-complete problems
12	Newsletter of the PC Community November 2011 Welcome Frances Rosamond, Editor Congratulations to Serge Gaspers and Mohammad Taghi Hajiaghayi for multiple awards, to Yoichi Iwata for the IPEC Excellent Student Paper award Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2012-09-17 05:09:27 NP-complete problems Parameterized complexity Kernelization NP-complete Bidimensionality Dominating set Clique problem Feedback vertex set Vertex cover Theoretical computer science Computational complexity theory Applied mathematics
13	Exact Algorithms and Fixed-Parameter Tractability Summary of Dagstuhl Seminar[removed]July–29. July 2005 Rod Downey 1 Add to Reading List Source URL: drops.dagstuhl.de Language: English - Date: 2006-01-19 05:18:59 NP-complete problems Analysis of algorithms Matroid theory Parameterized complexity Complexity classes Clique problem Vertex cover Time complexity Matroid Theoretical computer science Computational complexity theory Mathematics
14	Chapter 8 NP-complete problems Add to Reading List Source URL: www.cs.berkeley.edu Language: English - Date: 2006-10-03 05:00:11 NP-complete problems Minimum spanning tree Vertex cover Clique problem Travelling salesman problem Independent set Shortest path problem NP-complete Matching Theoretical computer science Computational complexity theory Mathematics
15	PDF Document Add to Reading List Source URL: theinf1.informatik.uni-jena.de Language: English - Date: 2007-02-16 07:21:01 Complexity classes NP-complete problems Closest string Parameterized complexity Clique problem Vertex cover Polynomial-time approximation scheme String Approximation algorithm Theoretical computer science Computational complexity theory Applied mathematics
16	PDF Document Add to Reading List Source URL: cs.nyu.edu Language: English - Date: 2010-03-18 10:25:26 NP-complete problems Complexity classes Vertex cover Graph theory MAX-3SAT Approximation algorithm Graph coloring Clique problem Time complexity Theoretical computer science Computational complexity theory Applied mathematics

UPDATE